Search results for "Computer Science::Programming Languages"
showing 10 items of 69 documents
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
1996
The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…
Multi-letter reversible and quantum finite automata
2007
The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…
Temperature dependence of the rate constant of hydrogen isotope interactions with a lithium capillary-porous system under reactor irradiation
2013
Abstract Experiments with a sample of a lithium capillary-porous system (CPS) were performed at the reactor IVG-1.M of the Institute of Atomic Energy NNC RK to study the effects of neutron irradiation on the parameters of hydrogen isotope interactions with a lithium CPS. The absorption technique was used during the experiments, and this technique allowed the temperature dependences of the hydrogen isotope interaction rate constants with the lithium CPS to be obtained under various reactor powers. The obtained dependencies were used to determine the main interaction parameters: the activation energies and the pre-exponents of the Arrhenius dependence of the hydrogen interaction rate constant…
HAWK 2.0: A Monte Carlo program for Higgs production in vector-boson fusion and Higgs strahlung at hadron colliders
2019
Abstract The Monte Carlo integrator HAWK provides precision predictions for Higgs production at hadron colliders in vector-boson fusion and Higgs strahlung, i.e. in production processes where the Higgs boson is Attached to WeaK bosons. The fully differential predictions include the full QCD and electroweak next-to-leading-order corrections. Results are computed as integrated cross sections and as binned distributions for important hadron-collider observables. Title of program: HAWK, version 2.0 Catalogue Id: AEWT_v1_0 Nature of problem Precision calculation of cross sections and differential distributions for Higgs-boson production in vector-boson fusion and Higgs strahlung at the LHC as de…
AMYR 2: A new version of a computer program for pair potential calculation of molecular associations
2019
Abstract AMYR is a computer program for the calculation of molecular associations using Fraga's pairwise atom - atom potential. The interaction energy is evaluated through a 1/R expansion. The electrostatic energy is calculated through either the one-centre-per atom or the three-centres-per atom model by Hunter and Sanders. A pairwise dispersion energy term is included in the potential and corrected by a damping function. The program carries out energy minimizations through variable metric methods. Th... Title of program: AMYR 2 Catalogue Id: ADIW_v1_0 Nature of problem The program determines the optimum separation and relative orientation of two interacting molecular systems through a mini…
On the Quantum and Classical Complexity of Solving Subtraction Games
2019
We study algorithms for solving Subtraction games, which are sometimes referred as one-heap Nim games.
Understanding star-fundamental algebras
2021
Star-fundamental algebras are special finite dimensional algebras with involution ∗ * over an algebraically closed field of characteristic zero defined in terms of multialternating ∗ * -polynomials. We prove that the upper-block matrix algebras with involution introduced in Di Vincenzo and La Scala [J. Algebra 317 (2007), pp. 642–657] are star-fundamental. Moreover, any finite dimensional algebra with involution contains a subalgebra mapping homomorphically onto one of such algebras. We also give a characterization of star-fundamental algebras through the representation theory of the symmetric group.
Complex group algebras of finite groups: Brauer’s Problem 1
2005
Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.
Automatic construction of test sets: Theoretical approach
2005
We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…
"Table 3" of "Search for supersymmetry using final states with one lepton, jets, and missing transverse momentum with the ATLAS detector in sqrt{s} =…
2011
Distribution of M(C=EFFECTIVE) IN GEV for data and background MC calculation.